Simulation and the Monte Carlo Method by Rubinstein Reuven Y.; Kroese Dirk P.; & Dirk P. Kroese

Author:Rubinstein, Reuven Y.; Kroese, Dirk P.; & Dirk P. Kroese
Language: eng
Format: epub
ISBN: 9781118632383
Publisher: John Wiley & Sons, Incorporated
Published: 2016-10-07T12:00:00+00:00

■ EXAMPLE 6.12 Traveling Salesman Problem

The traveling salesman problem (TSP) can be formulated as follows: Consider a weighted graph with nodes, labeled . The nodes represent cities, and the edges represent the roads between the cities. Each edge from to has weight or cost , representing the length of the road. The problem is to find the shortest tour that visits all the cities exactly once except the starting city, which is also the terminating city. An example is given in Figure 6.11, where the bold lines form a possible tour.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.